Auflistung nach Schlagwort "finite model theory"

Sortiert nach: Sortierung: Ergebnisse:

  • Descriptive complexity of circuit-based counting classes 
    Haak, Anselm (Hannover : Institutionelles Repositorium der Leibniz Universität Hannover, 2021)
    In this thesis, we study the descriptive complexity of counting classes based on Boolean circuits. In descriptive complexity, the complexity of problems is studied in terms of logics required to describe them. The focus ...
  • The power of the filtration technique for modal logics with team semantics 
    Lück, Martin (Wadern : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, 2017)
    Modal Team Logic (MTL) extends Väänänen's Modal Dependence Logic (MDL) by Boolean negation. Its satisfiability problem is decidable, but the exact complexity is not yet understood very well. We investigate a model-theoretical ...